prüfer sequence中文什么意思
发音:
普吕弗序列
百科释义
In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n???2, and can be generated by a simple iterative algorithm.
详细百科解释